Algebraic Techniques for Constructing Minimal Weight Threshold Functions
نویسندگان
چکیده
منابع مشابه
Algebraic Techniques for Constructing Minimal Weight Threshold Functions
A linear threshold element computes a function that is a sign of a weighted sum of the input variables. The best known lower bounds on the size of threshold circuits are for depth-2 circuits with small (polynomial-size) weights. However, in general, the weights are arbitrary integers and can be of exponential size in the number of input variables. Namely, obtaining progress in lower bounds for ...
متن کاملAlgebraic Techniques for Constructing Minimal Weight
A linear threshold element computes a function that is a sign of a weighted sum of the input variables. The weights are arbitrary integers; actually, they can be very big integers| exponential in the number of the input variables. While in the present literature a distinction is made between the two extreme cases of linear threshold functions with polynomial-size weights as opposed to those wit...
متن کاملAlgebraic Methods for Constructing One-way Trapdoor Functions
In this dissertation, we consider an extension of the discrete logarithm problem to the case of a semigroup acting on a finite set: the Semigroup Action Problem (SAP). New protocols and one-way trapdoor functions based on the difficulty of such problems are proposed. Several instances are studied both from a conceptual and cryptographic point of view. We discuss the application of existing gene...
متن کاملA New Algorithm for Constructing Minimal Perfect Hash Functions
We present a three-step algorithm for generating minimal perfect hash functions which runs very fast in practice. The first step is probabilistic and involves the generation of random graphs. The second step determines the order in which hash values are assigned to keys. The third step assigns hash values to the keys. We give strong evidences that first step takes linear random time and the sec...
متن کاملOn minimal cubature formulae for product weight functions 1
We derive in a simple way certain minimal cubature formulae, obtained by Morrow and Patterson [2], and Xu [4], using a different technique. We also obtain in explicit form new near minimal cubature formulae. Then, as a corollary, we get a compact expression for the bivariate Lagrange interpolation polynomials, based on the nodes of the cubature.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2002
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480197326048